C-expressions: a variable-free calculus for equational logic programming
نویسندگان
چکیده
منابع مشابه
Sequent Calculus and Equational Programming
Proof assistants and programming languages based on type theories usually come in two flavours: one is based on the standard natural deduction presentation of type theory and involves eliminators, while the other provides a syntax in equational style. We show here that the equational approach corresponds to the use of a focused presentation of a type theory expressed as a sequent calculus. A ty...
متن کاملStatic Analysis Techniques for Equational Logic Programming
An equational logic program is a set of directed equations or rules, which are used to compute in the obvious way (by replacing equals with “simpler” equals). We present static analysis techniques for efficient equational logic programming, some of which have been implemented in LR, a laboratory for developing and evaluating fast, efficient, and practical rewriting techniques. Two novel feature...
متن کاملEquational Programming : A Unifying Approach to Logic and Functional Programming
Bharat Jayaraman Department of Computer Science UniversitJI of North Carolina at Chapel Hill Chapel Hill, NC 1!151,4 Functional and logic languages have many similarities, but there are significant differences between them that the integration of functional and logic languages is a challenging problem. The approach presented in this paper is called equational programming. We show that equations...
متن کاملEquational programming in A-calculus via SL-systems. Part 2*
A system of equations in the l-calculus is a set of formulas of A (the equations) together with a finite set of variables of ,4 (the unknowns). A system Y is said to be P-solvable (fiq-solvable) iff there exists a simultaneous substitution with closed I-terms for the unknowns that makes the equations of 9’ theorems in the theory fi (&). A system 9’ can be viewed as a set of specifications (the ...
متن کاملOn Extra Variables in (Equational) Logic Programming
Extra variables in a clause are variables which occur in the body but not in the head. It has been argued that extra variables are necessary and contribute to the expressive power of logic languages. In the first part of this paper, we show that this is not true in general. For this purpose, we provide a simple syntactic transformation of each logic program into a logic program without extra va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90170-x